Edge-Coloring Bipartite Multigraphs to Select Network Paths
نویسنده
چکیده
We consider the idea of using a centralized controller to schedule network traffic within a datacenter and implement an algorithm that edge-colors bipartite multigraphs to select the paths that packets should take through the network. We implement three different data structures to represent the bipartite graphs: a matrix data structure, an adjacency list data structure, and an adjacency list data structure which tracks edges using bitmaps. We compare the performance of these three variations of the algorithm analytically and experimentally and conclude that the bitmap adjacency data structure performs best. This variation of the algorithm would allow us to select paths for a 10 Gbps datacenter with 800-1000 machines, or a 1 Gbps datacenter with 1500-2000 machines.
منابع مشابه
On the list chromatic index of nearly bipartite multigraphs
Galvin ([7]) proved that every k-edge-colorable bipartite multigraph is kedge-choosable. Slivnik ([11]) gave a streamlined proof of Galvin's result. A multigraph G is said to be nearly bipartite if it contains a special vertex Vs such that G Vs is a bipartite multigraph. We use the technique in Slivnik's proof to obtain a list coloring analog of Vizing's theorem ([12]) for nearly bipartite mult...
متن کاملChromatic Edge Strength of Some Multigraphs
The edge strength s(G) of a multigraph G is the minimum number of colors in a minimum sum edge coloring of G. We give closed formulas for the edge strength of bipartite multigraphs and multicycles. These are shown to be classes of multigraphs for which the edge strength is always equal to the chromatic index.
متن کاملInterval non-edge-colorable bipartite graphs and multigraphs
An edge-coloring of a graph G with colors 1, . . . , t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In 1991 Erdős constructed a bipartite graph with 27 vertices and maximum degree 13 which has no interval coloring. Erdős’s counterexample is the smallest (in a sense of maximum degree) k...
متن کاملAn Algorithm for Computing Edge Colorings on Regular Bipartite Multigraphs
In this paper, we consider the problem of finding an edge coloring of a d-regular bipartite multigraph with 2n vertices and m = nd edges. The best known deterministic algorithm (by Cole, Ost, and Schirra) takes O(m log d) time to find an edge coloring of such a graph. This bound is achieved by combining an O(m)-time perfect-matching algorithm with the Euler partition algorithm. The O(m) time bo...
متن کاملEdge Coloring with Delays
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on one side are the transmitters and the nodes on the other side are the receivers. The edges correspond to messages, and every edge e is associated with an integer c(e), corresponding to the time it takes the message to r...
متن کامل